Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
نویسندگان
چکیده
We determine connected bipartite regular graphs with four distinct adjacency eigenvalues that induce periodic Grover walks, and show it is only C6. also there are three kinds of the second largest five eigenvalues. Using walk-regularity, we enumerate feasible spectra for such graphs.
منابع مشابه
Two spectral characterizations of regular, bipartite graphs with five eigenvalues
Graphs with a few distinct eigenvalues usually possess an interesting combinatorial structure. We show that regular, bipartite graphs with at most six distinct eigenvalues have the property that each vertex belongs to the constant number of quadrangles. This enables to determine, from the spectrum alone, the feasible families of numbers of common neighbors for each vertex with other vertices in...
متن کاملQuantum Walks on Regular Graphs and Eigenvalues
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We find the eigenvalues of S+(U) and S+(U2) for regular graphs and show that S+(U2) = S+(U)2 + I.
متن کاملBipartite graphs with five eigenvalues and pseudo designs
A pseudo (v, k, λ)-design is a pair (X,B), where X is a v-set, and B = {B1, . . . ,Bv−1} is a collection of k-subsets (blocks) of X such that any two distinct Bi,Bj intersect in λ elements, and 0 ≤ λ < k ≤ v−1. We use the notion of pseudo designs to characterize graphs of order n whose (adjacency) spectrum contains zero and ±θ with multiplicity (n− 3)/2 where 0 < θ ≤√2. Meanwhile, partial resul...
متن کاملMedian eigenvalues of bipartite graphs
For a graph G of order n and with eigenvalues λ1 > · · · > λn, the HL-index R(G) is defined as R(G) = max { |λb(n+1)/2c|, |λd(n+1)/2e| } . We show that for every connected bipartite graph G with maximum degree ∆ > 3, R(G) 6 √ ∆− 2 unless G is the the incidence graph of a projective plane of order ∆− 1. We also present an approach through graph covering to construct infinite families of bipartit...
متن کامل0 On bipartite graphs of defect at most 4 Ramiro
We consider the bipartite version of the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 2, find the maximum number Nb(∆,D) of vertices in a bipartite graph of maximum degree ∆ and diameter D. In this context, the Moore bipartite bound Mb(∆,D) represents an upper bound for Nb(∆,D). Bipartite graphs of maximum degree ∆, diameter D and order Mb(∆,D), called Moore bipartite gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.08.030